Recursive Algorithm for Generating Two-staged Cutting Patterns of Punched Strips

نویسنده

  • Yaodong Cui
چکیده

The manufacture of parts made of metal sheet often includes two successive processes: the cutting process at which a guillotine shear cuts the sheet into strips, and the punching process at which a stamping press punches out the blanks from the strips. This paper presents an algorithm for generating optimal two-staged cutting patterns of strips for the cutting process. At the first stage the sheet is divided into segments with parallel cuts. Each segment contains strips with the same length and direction. The segments are cut into strips at the second stage. The algorithm calls a recursion function to determine the optimal strip layouts on segments of various lengths, and calls another recursion function to optimally arrange the segments in the sheet, so that the value of the pattern reaches maximum. The computational results indicate that the algorithm is efficient both in computation time and in material usage. Keywordstwo-dimensional cutting, Strip layout, Stamping, Recursion

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating unconstrained two-dimensional non-guillotine cutting patterns by a Recursive Partitioning Algorithm

In this study, a dynamic programming approach to deal with the unconstrained twodimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer’s pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. Since a counterexamp...

متن کامل

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

An Algorithm for Two Dimensional Cutting Stock Problems with Demand

In this paper, two-dimensional cutting stock problem with demand has been studied.In this problem, cutting of large rectangular sheets into specific small pieces should be carried out hence, the waste will be minimized. Solving this problem is important to decrease waste materials in any industry that requires cutting of sheets. In most previus studies, the demand of pieces has not been usually...

متن کامل

GRASP and Path Relinking for the

In this paper, we develop a greedy randomized adaptive search procedure (GRASP) for the constrained two-dimensional two-staged cutting stock problem. This is a special cutting problem in which the cut is performed in two phases. In the first phase, the stock rectangle is slit down its width into different vertical strips and in the second phase, each of these strips is processed to obtain the f...

متن کامل

Integrated approaches for generating and sequencing cutting patterns in two-dimensional cutting stock problems

This paper deals with the classical two-dimensional cutting stock problem, which consists of generating cutting patterns to produce bi rectangular items of sizes (li,wi), i=1,..,m, from rectangular objects of sizes (L,W), so that an objective is optimized, for example, the cost or trim loss. However, to cut the patterns they should be sequenced in such a way as to optimize another objective, fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007